public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();

        binaryTree.proPrint(root);
        System.out.println();

        root = binaryTree.createTree();
        binaryTree.midPrint(root);
        System.out.println();

        root = binaryTree.createTree();
        binaryTree.rePrint(root);
        System.out.println();

        BinaryTree.TreeNode  size = binaryTree.find(root,'G');

        /*Boolean a = binaryTree.identify(root ,root);
        System.out.println("结果： " + a  );*/
        /*int he = binaryTree.height(root);
        System.out.println(he);*/
        /*boolean a = binaryTree.wholeTree(root);
        System.out.println(a);*/
        /*BinaryTree.TreeNode D = new BinaryTree.TreeNode('D');
        BinaryTree.TreeNode C = new BinaryTree.TreeNode('H');

        boolean treeNode=   binaryTree.find1(root,D,C);*/
        //System.out.println(treeNode);
        //binaryTree.rePrintTree(root);
        char[] chars1 = {'A' ,'B' ,'D' ,'E' ,'H' ,'C' ,'F' ,'G'};
        char[] chars2 = {'D' ,'B' ,'E' ,'H' ,'A' ,'F' ,'C' ,'G'};

        BinaryTree.TreeNode root1 = binaryTree.createTree2(chars1,chars2,0,7);
        binaryTree.proPrint(root1);


    }


}
